Search results
49 packages found
Blazing fast, tree-shakeable, type-safe, modern utility library to sort any type of array in less than 1 KB!
Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.
- array to tree
- list to tree
- unflatten
- array-helper
- array-manipulations
- data-structures
- datastructures
- algorithms
- tree-structure
- array
- list
- collection
- pointer
- parent
- View more
Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.
- array to tree
- list to tree
- unflatten
- array-helper
- array-manipulations
- data-structures
- datastructures
- algorithms
- tree-structure
- array
- list
- collection
- pointer
- parent
- View more
Convert a plain array of nodes (with pointers to parent nodes) to a tree
A lightweight JavaScript library that generates customizable tree views to better visualize JSON data.
Lets you Iterate a Array-Tree in a high performance tested manner with the ability to get parents back as well
Convert a plain array of nodes (with pointers to parent nodes) to a tree
Higher Order Functions for trees. Tree reductions to simplify processing.
Convert an array of parent-child relational objects to a tree
Conversion between tree data and array data
Convert large amounts of data array to tree fastly
Recursively add named keys to arrays of objects
object-observer utility provides simple means to (deeply) observe specified object/array changes; implemented via native Proxy; changes delivered in a synchronous way
- object
- array
- observe
- observer
- object observe
- object.observe
- observable
- changes
- deep
- tree
- graph
- javascript
- proxy
- C
- View more
A utility that flattens the portlet registry tree into an array
array to tree,depend on id and pid ## 一维数组转换为树型结构
Blazing fast, tree-shakeable, type-safe, modern utility library to sort any type of array in less than 1 KB!
A unit of a data structure to build elegant trees or cherry blossoms
Convert array to binary tree and vice versa using level order traversal like LeetCode.
flat array translate to tree data,以递归的方式把扁平数组转换成树形结构